Consecutive Integers in High-multiplicity Sumsets
نویسنده
چکیده
Sharpening (a particular case of) a result of Szemerédi and Vu [SV06] and extending earlier results of Sárközy [S89] and ourselves [L97b], we find, subject to some technical restrictions, a sharp threshold for the number of integer sets needed for their sumset to contain a block of consecutive integers of length, comparable with the lengths of the set summands. A corollary of our main result is as follows. Let k, l > 1 and n > 3 be integers, and suppose that A1, . . . , Ak ⊆ [0, l] are integer sets of size at least n, none of which is contained in an arithmetic progression with difference greater than 1. If k > 2 ⌈(l − 1)/(n − 2)⌉, then the sumset A1+· · ·+Ak contains a block of consecutive integers of length k(n − 1). 1. Background and summary of results The sumset of subsets A1, . . . , Ak of an additively written group is defined by A1 + · · ·+ Ak := {a1 + · · ·+ ak : a1 ∈ A1, . . . , ak ∈ Ak}; if A1 = · · · = Ak = A, this is commonly abbreviated as kA. In the present paper we will be concerned exclusively with the group of integers, in which case a well-known phenomenon occurs: if all sets Ai are dense, and their number k is large, then the sumset A1 + · · · + Ak contains long arithmetic progressions. There are numerous ways to specialize this statement, indicating the exact meaning of “dense”, “large”, and “long”, but in our present context the following result of Sárközy is the origin of things. Theorem 1 (Sárközy [S89, Theorem 1]). Let l > n > 2 be integers, and write κ := ⌈(l + 1)/(n− 1)⌉. Then, for every integer set A ⊆ [1, l] with |A| = n, there exist positive integers d 6 κ − 1 and k < 118κ such that the sumset kA contains l consecutive multiples of d. In [L97b] we established a sharp version of this result, replacing the factor 118 with 2 (which is the best possible value, as conjectured by Sárközy) and indeed, going somewhat further. The author gratefully acknowledges the support of the Georgia Institute of Technology and the Fields Institute, which he was visiting while conducting his research. 1
منابع مشابه
Congruence properties of the Ω-function on sumsets
Throughout this paper, we shall use the following notation: c1,c2,. . . denote positive absolute constants. Z, N and N0 denote the set of integers, positive integers and non-negative integers respectively. The cardinality of a set S is denoted by |S|. bxc and {x} denote the integer part and the fractional part of x and ‖x‖ denotes the distance from x to the nearest integer: ‖x‖ = min({x}, 1 − {...
متن کاملOn Sets Free of Sumsets with Summands of Prescribed Size
We study extremal problems about sets of integers that do not contain sumsets with summands of prescribed size. We analyse both finite sets and infinite sequences. We also study the connections of these problems with extremal problems of graphs and hypergraphs.
متن کاملSumsets being squares
Alon, Angel, Benjamini and Lubetzky recently studied an old problem of Euler on sumsets for which all elements of A + B are integer squares. Improving their result we prove: 1. There exists a set A of 3 positive integers and a corresponding set B ⊂ [0, N ] with |B| ≫ (logN)15/17, such that all elements of A+B are perfect squares. 2. There exists a set A of 3 integers and a corresponding set B ⊂...
متن کاملSome Additive Combinatorics Problems in Matrix Rings
We study the distribution of singular and unimodular matrices in sumsets in matrix rings over finite fields. We apply these results to estimate the largest prime divisor of the determinants in sumsets in matrix rings over the integers. 2000 Mathematics Subject Classification. 11C20, 11D79, 11T23
متن کاملARITHMETIC PROGRESSIONS IN SPARSE SUMSETS Dedicated to Ron Graham on the occasion of his 70 birthday
In this paper we show that sumsets A + B of finite sets A and B of integers, must contain long arithmetic progressions. The methods we use are completely elementary, in contrast to other works, which often rely on harmonic analysis.
متن کامل